منابع مشابه
A Las Vegas approximation algorithm for metric 1-median selection
Given an n-point metric space, consider the problem of finding a point with the minimum sum of distances to all points. We show that this problem has a randomized algorithm that always outputs a (2+ )-approximate solution in an expected O(n/ 2) time for each constant > 0. Inheriting Indyk’s [9] algorithm, our algorithm outputs a (1 + )-approximate 1-median in O(n/ 2) time with probability Ω(1).
متن کاملA lower bound for metric 1-median selection
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic o(n 2)-query (4 − Ω(1))-approximation algorithms.
متن کاملA lower bound for 1-median selection in metric spaces
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic nonadaptive o(n)-query (4− Ω(1))-approximation algorithms.
متن کاملOn Ultrametric Algorithmic Information
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate representation to our objects, based on a hierarchical coding of information, we exemplify how it is remarkably easy to compute complex obje...
متن کاملOn the median-of-K version of Hoare's selection algorithm
In Hoare’s (1961) original version of the algorithm Find the partitioning element in the central divide-and-conquer step is chosen uniformly at random from the set S in question. Here we consider a variant where this element is the median of a sample of size 2k + 1 from S. We investigate convergence in distribution of the number of comparisons required and obtain a simple explicit result for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.04.021